Inconsistency lemmas in algebraic logic
نویسندگان
چکیده
منابع مشابه
Inconsistency lemmas in algebraic logic
In this paper, the inconsistency lemmas of intuitionistic and classical propositional logic are formulated abstractly. We prove that, when a (finitary) deductive system ` is algebraized by a variety K, then ` has an inconsistency lemma—in the abstract sense—iff every algebra in K has a dually pseudo-complemented join semilattice of compact congruences. In this case, the following are shown to b...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملInconsistency Robustness in Logic Programs
Logic Programming can be broadly defined as “using logic to infer computational steps from existing propositions” (although this has been opposed by Kowalski; see below). The focus of this article is on the development of this idea. Consequently, it does not treat any other associated topics related to Logic Programming such as constraints, abduction, etc. The idea has a long development that w...
متن کاملCategorical abstract algebraic logic: The Diagram and the Reduction Operator Lemmas
The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first-order structure by constants is presented. Furthermore, analogs of the Diagram Lemma...
متن کاملXLIX Inconsistency , Logic Databases , and
IntroductIon Nowadays, data management on the World Wide Web needs to consider very large knowledge databases (KDB). The larger is a KDB, the smaller the possibility of being consistent. Consistency in checking algorithms and systems fails to analyse very large KDBs, and so many have to work every day with inconsistent information. Database revision—transformation of the KDB into another, consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2013
ISSN: 0942-5616
DOI: 10.1002/malq.201200020